全文获取类型
收费全文 | 25907篇 |
免费 | 631篇 |
国内免费 | 675篇 |
专业分类
化学 | 1820篇 |
晶体学 | 68篇 |
力学 | 985篇 |
综合类 | 80篇 |
数学 | 18647篇 |
物理学 | 5613篇 |
出版年
2023年 | 262篇 |
2022年 | 304篇 |
2021年 | 569篇 |
2020年 | 613篇 |
2019年 | 422篇 |
2018年 | 546篇 |
2017年 | 894篇 |
2016年 | 799篇 |
2015年 | 907篇 |
2014年 | 1348篇 |
2013年 | 1831篇 |
2012年 | 1559篇 |
2011年 | 1563篇 |
2010年 | 1522篇 |
2009年 | 1626篇 |
2008年 | 1299篇 |
2007年 | 1356篇 |
2006年 | 1201篇 |
2005年 | 913篇 |
2004年 | 633篇 |
2003年 | 651篇 |
2002年 | 679篇 |
2001年 | 689篇 |
2000年 | 469篇 |
1999年 | 634篇 |
1998年 | 430篇 |
1997年 | 315篇 |
1996年 | 314篇 |
1995年 | 221篇 |
1994年 | 222篇 |
1993年 | 208篇 |
1992年 | 215篇 |
1991年 | 177篇 |
1990年 | 172篇 |
1989年 | 127篇 |
1988年 | 139篇 |
1987年 | 110篇 |
1986年 | 93篇 |
1985年 | 195篇 |
1984年 | 183篇 |
1983年 | 92篇 |
1982年 | 114篇 |
1981年 | 114篇 |
1980年 | 92篇 |
1979年 | 71篇 |
1978年 | 60篇 |
1977年 | 48篇 |
1976年 | 48篇 |
1975年 | 38篇 |
1974年 | 30篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
1.
Nonlinear Dynamics - This paper concerns the problem of fixed-time synchronization of master–slave Lorenz systems. The adaptive control and fixed-time control strategies are successfully... 相似文献
2.
《Discrete Mathematics》2022,345(12):113083
Let G be a graph, the order of G, the connectivity of G and k a positive integer such that . Then G is said to be k-extendable if it has a matching of size k and every matching of size k extends to a perfect matching of G. A Hamiltonian path of a graph G is a spanning path of G. A bipartite graph G with vertex sets and is defined to be Hamiltonian-laceable if such that and for every pair of vertices and , there exists a Hamiltonian path in G with endpoints p and q, or and for every pair of vertices , there exists a Hamiltonian path in G with endpoints p and q. Let G be a bipartite graph with bipartition . Define to be a maximum integer such that and (1) for each non-empty subset S of X, if , then , and if , then ; and (2) for each non-empty subset S of Y, if , then , and if , then ; and (3) if there is no non-negative integer satisfying (1) and (2).Let G be a bipartite graph with bipartition such that and . In this paper, we show that if , then G is Hamiltonian-laceable; or if , then for every pair of vertices and , there is an -path P in G with . We show some of its corollaries in k-extendable, bipartite graphs and a conjecture in k-extendable graphs. 相似文献
3.
Mathematical Programming - This article studies the solutions of time-dependent differential inclusions which is motivated by their utility in optimization algorithms and the modeling of physical... 相似文献
4.
5.
6.
7.
8.
Dariusz Marek Adam Domaski Joanna Domaska Jakub Szygua Tadeusz Czachrski Jerzy Klamka 《Entropy (Basel, Switzerland)》2021,23(5)
In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature. 相似文献
9.
10.